A K-Means Clustered Routing Algorithm with Location and Energy Awareness for Underwater Wireless Sensor Networks

Data delivery in harsh underwater channels consumes a higher transmission power than that terrestrial networks. However, due to the complexity of environment, energy supply nodes wireless sensor networks is usually limited by their required laborious battery replacement. Thus, consumption considered one key issues optical communication. To minimize such for nodes, much research interest has been found on K-Means technology designing routing algorithms. these algorithms have not regarded located site and remaining simultaneously, which might affect efficiency. In this paper, we propose clustered algorithm, namely location energy-aware k-means (LE-KCR) applies K-means regarding both each node. proposed LE-KCR candidate cluster-head, as well distance between it its sink node, are cluster-head selection. addition, given inaccessibility some whole network resulting from range clusters, dual-hop technique adopted edge nodes. The simulation results indicate algorithm remarkably reduces dead when compared traditional low-energy adaptive clustering hierarchy (LEACH) protocol optimized LEACH based technology.